用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code

A branch-and-bound algorithm for asymmetric TSP

分支限界法类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm